home *** CD-ROM | disk | FTP | other *** search
- '.so tmac.clman
- .TH "lGetNode"
- .IX lGetNode
- .SH NAME
- lGetNode - Get node.
- .SH SYNOPSIS
- int
- .BR "lGetNode" "(id, which, data, size)"
- .br
- .RT
- .RP
- In int id identifier of linked list
- .RP
- In int which which node must be retrieved
- .RP
- Out Byte *data data of node
- .RP
- In int size size of data
- .DT
- .SH DESCRIPTION
- \fBlGetNode\fP gets the data of a node of a linked list. Which node must
- be retrieved can be specified by \fIwhich\fP. The first node, the current
- node, the node before or after the current node and the node at the end
- of the list can be retrieved.
- .br
- Backward retrieving is only possible for doubly linked list. A previous
- node can't be retrieved for singly linked lists.
- .br
- When the retrieved node is the first or the last node, the return code
- will have the value lFIRST or lLAST. For the other nodes the routine
- returns lSUCCESS.
- .SH PARAMETER DEFINITIONS
- .if t .ta 0.2i 1.5i
- \fIwhich\fP :
- .nf
- lFIRST first node
- lPREVIOUS previous node
- lCURRENT current node
- lNEXT next node
- lLAST last node
- .fi
- .SH RETURN CODES
- .nf
- Return on success :
- lSUCCESS, lFIRST, lLAST
- Return on error :
- .fi
- .in +02.i
- lUNKNOWN_ID, lEMPTY_LIST, lWRONG_WHICH, lEOL, lNOT_DOUBLY, lSIZE_NE
- .in -02.i
- .SH AUTHOR
- Anita Eijs (TNO - Bouw - BouwInformatica)
-